Approximation Algorithms for Max Sat: a Better Performance Ratio at the Cost of a Longer Running Time
نویسندگان
چکیده
We describe approximation algorithms for (unweighted) MAX SAT with performance ratios arbitrarily close to 1 (in particular, when performance ratios exceed the limit of polynomialtime approximation). Namely, we show how to construct an (α + ε)-approximation algorithm A from a given polynomial-time α-approximation algorithm A0. The algorithm A runs in time of the order φ −1 K , where φ is the golden ratio (≈ 1.618) and K is the number of clauses in the input formula. Thus we estimate the cost of improving a performance ratio. Similar constructions for MAX 2SAT and MAX 3SAT are described too. We apply our constructions to some known polynomial-time algorithms taken as A0 and give upper bounds on the running time of the respective algorithms A.
منابع مشابه
Pdmi Preprint — 14/1998 Approximation Algorithms for Max Sat: a Better Performance Ratio at the Cost of a Longer Running Time
We describe approximation algorithms for (unweighted) MAX SAT with performance ratios arbitrarily close to 1 (in particular, when performance ratios exceed the limit of polynomialtime approximation). Namely, we show how to construct an (α + ε)-approximation algorithm A from a given polynomial-time α-approximation algorithm A0. The algorithm A runs in time of the order φ −1 K , where φ is the go...
متن کاملApproximation Algorithms for MAX SAT
Maximum Satisfiability Problem (MAX SAT) is one of the most natural optimization problems. It is known to be NP-hard. Hence, approximation algorithms have been considered. The aim of this survey is to show recent developments of approximation algorithms for MAX SAT. We will confine ourselves to approximation algorithms with theoretical performance guarantees. For other approximation algorithms ...
متن کاملOn the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the art in performance for universal (i.e. non specialized solvers) seems to be variants of Simulated Annealing (SA) and MaxWalkSat (MWS), stochastic local search methods. Local search methods are conceptually simple, and ...
متن کاملSome New Randomized Approximation Algorithms
The topic of this thesis is approximation algorithms for optimization versions of NP-complete decision problems. No exact algorithms with sub-exponential running times are known for these problems, and therefore approximation algorithms with polynomial running times are studied. An approximation algorithm does not necessarily nd the optimal solution, but it leaves a guarantee of how far from th...
متن کاملRevision 01 of Better Approximation Algorithms and Tighter Analysis for Set Splitting and Not-all-equal Sat
We construct new approximation algorithms for Max Set Splitting and Max Not-All-Equal Sat, which when combined with existing algorithms give the best approximation results so far for these problems. Furthermore, when analyzing our combination of approximation algorithms, we introduce a novel technique, which improves the analysis of the performance ratio of such algorithms. In contrast with pre...
متن کامل